A Human Like Incremental Decision Tree Algorithm: Combining Rule Learning, Pattern Induction, and Storing Examples
نویسندگان
چکیده
Early machine learning research was strongly interrelated with research on human category learning while later on the focus shifted to the development of algorithms with high performance. Only recently, there is a renewed interest in cognitive aspects of learning. Machine learning approaches might be able to model and explain human category learning while cognitive models might inspire new, more human like, approaches to machine learning. In cognitive science research there exist different theories of category learning, especially, rule-based approaches, prototypes, and exemplar-based theories. To take account of the flexibility of human learning and categorization we propose a human like learning algorithm. In the algorithm we combine incremental decision tree learning, least general generalization, and storing examples for similarity-based categorization. In this paper we present first ideas of this algorithm.
منابع مشابه
MMDT: Multi-Objective Memetic Rule Learning from Decision Tree
In this article, a Multi-Objective Memetic Algorithm (MA) for rule learning is proposed. Prediction accuracy and interpretation are two measures that conflict with each other. In this approach, we consider accuracy and interpretation of rules sets. Additionally, individual classifiers face other problems such as huge sizes, high dimensionality and imbalance classes’ distribution data sets. This...
متن کاملInformation-Theoretic Rule Induction
1 Background and motivation incremental learning (e.g., in decision tree design the entire tree algorithm must be re-run) while symbolic The problem of induction or "learning from exalgorithms often incorporate incremental learning as amples" can roughly be divided into two distinct cata basic mechanism. On the other hand, symbolic egories, namely the symbolic manipulation approach techniques c...
متن کاملLearning as Optimization
This dissertation is concerned with inductive learning from examples, and the reduction of learning problems to associated optimization problems. The emphasis is on learning to classify. Theoretical results include (1) examining the application of Occam’s Razor in a general learning setting; (2) investigating two optimization problems associated with learning using linear threshold functions, a...
متن کاملResearch on an Improved Decision Tree Classification Algorithm
In the paper, with the introduction of data mining algorithm of the classification in detail, and then combining the classification algorithm and incremental learning technology, an incremental decision tree algorithm is proposed to solve the problem of incremental learning and analysis the experimental data for this algorithm. The paper used ID3 and C4.5 algorithm for detailed research. Accord...
متن کاملIncremental Rule Induction for Multicriteria and Multiattribute Classification
Incremental induction of decision rules within the dominance-based rough set approach to the multicriteria and multiattribute classification is discussed. We introduce an algorithm, called Glance, that incrementally induces a set of all rules from examples. We experimentally evaluate it and compare with two other algorithms, previously proposed for this kind of classification problem.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2017